XOR games with no quantum advantage and the Shannon zero-error channel capacity
نویسندگان
چکیده
Ravishankar Ramanathan,1, ∗ Alastair Kay,2, 3 Gláucia Murta,1, 4 Remigiusz Augusiak,5 Michał Horodecki,6, 7 and Paweł Horodecki1, 8 National Quantum Information Center of Gdańsk, 81-824 Sopot, Poland Department of Mathematics, Royal Holloway University of London, Egham, Surrey, TW20 0EX, UK University of Gdańsk, 80-952 Gdańsk, Poland Departamento de Fisica, Universidade Federal de Minas Gerais, Caixa Postal 702, 30123-970, Belo Horizonte, MG, Brazil ICFO-Institut de Ciencies Fotoniques, Mediterranean Technology Park, 08860 Castelldefels (Barcelona), Spain National Quantum Information Center of Gdańsk, 81-824 Sopot, Poland Institute of Theoretical Physics and Astrophysics, University of Gdańsk, 80-952 Gdańsk, Poland Faculty of Applied Physics and Mathematics, Technical University of Gdańsk, 80-233 Gdańsk, Poland
منابع مشابه
Characterising the Performance of XOR Games and the Shannon Capacity of Graphs
In this Letter we give a set of necessary and sufficient conditions such that quantum players of a two-party XOR game cannot perform any better than classical players. With any such game, we associate a graph and examine its zero-error communication capacity. This allows us to specify a broad new class of graphs for which the Shannon capacity can be calculated. The conditions also enable the pa...
متن کاملProduct Rules in Semidefinite Programming
In recent years we witness the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4] and even in complexity theory [7]. Examples to such bounds include the semidefinite relaxation for the maximal cut problem [5], and the quantum value of multi-prover interactive games [3,4]. The first semidefinite programming bound, which gained fa...
متن کاملZero-error Source-channel Coding with Entanglement
We study the use of quantum entanglement in the zero-error source-channel coding problem. Here, Alice and Bob are connected by a noisy classical one-way channel, and are given correlated inputs from a random source. Their goal is for Bob to learn Alice’s input while using the channel as little as possible. In the zero-error regime, the optimal rates of source codes and channel codes are given b...
متن کاملZero-Error Capacity of a Quantum Channel
The zero-error capacity of a discrete classical channel was first defined by Shannon as the least upper bound of rates for which one transmits information with zero probability of error [C. Shannon, IRE Trans. Inform. Theory, IT-2(3):8–19, 1956]. Here, we define the quantum zero-error capacity, a new kind of classical capacity of a noisy quantum channel C represented by a trace-preserving map (...
متن کاملQuantum Channel Capacity of Very Noisy Channels
We present a family of additive quantum error-correcting codes whose capacities exceeds that of quantum random coding (hashing) for very noisy channels. These codes provide non-zero capacity in a depolarizing channel for fidelity parameters f when f > .80944. Random coding has non-zero capacity only for f > .81071; by analogy to the classical Shannon coding limit, this value had previously been...
متن کامل